A primal-dual exterior point algorithm for linear programming problems

A Primal-Dual Interior Point Algorithm for Linear Programming

This chapter presents an algorithm that works simultaneously on primal and dual linear programming problems and generates a sequence of pairs of their interior feasible solutions. Along the sequence generated, the duality gap converges to zero at least linearly with a global convergence ratio (1 Yf/n); each iteration reduces the duality gap by at least Yf/n. Here n denotes the size of the probl...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming

No part of this report may be reproduced in any form, by print, photoprint, microolm or any other means without written permis

A relaxed primal-dual path-following algorithm for linear programming

In this paper, we provide an easily satisfied relaxation condition for the primaldual interior path-following algorithm to solve linear programming problems. It is shown that the relaxed algorithm preserves the property of polynomial-time convergence. The computational results obtained by implementing two versions of the relaxed algorithm with slight modifications clearly demonstrate the potent...

A Primal-Dual Exterior Point Method for Nonlinear Optimization

In this paper, primal-dual methods for general nonconvex nonlinear optimization problems are considered. The proposed methods are exterior point type methods that permit primal variables to violate inequality constraints during the iterations. The methods are based on the exact penalty type transformation of inequality constraints and use a smooth approximation of the problem to form primal-dua...